A case study on financial ratios via cross%2Dgraph quasi%2Dbicliques.

Adaptive Ensemble Classification in P2P Networks.

Mining Outliers with Ensemble of Heterogeneous Detectors on Random Subspaces.

On Classifying Drifting Concepts in P2P Networks.

Satrap Data and Network Heterogeneity Aware P2P Data%2DMining.

Mining Actionable Subspace Clusters in Sequential Data.

P2PDocTagger Content management through automated P2P collaborative tagging.
As the amount of user generated content grows, personal information management has become a challenging problem. Several information management approaches, such as desktop search, document organization and (collaborative) document tagging have been proposed to address this, however they are either inappropriate or inefficient. Automated collaborative document tagging approaches mitigate the problems of manual tagging, but they are usually based on centralized settings which are plagued by problems such as scalability, privacy, etc. To resolve these issues, we present P2PDocTagger, an automated and distributed document tagging systembasedonclassification inP2Pnetworks. P2P-DocTagger minimizes the efforts of individual peers and reduces computation and communication cost while providing high tagging accuracy, and eases of document organization/retrieval. Inaddition, weprovidearealistic andflexible simulation toolkit – P2PDMT, to facilitate the development and testing of P2P data mining algorithms. 1.
Epsilon Equitable Partition On Scheduling Data Loading and View Maintenance in Soft Real%2Dtime Data Warehouses.

Communication%2DEfficient Classification in P2P Networks.

Efficient Pruning Schemes for Distance%2DBased Outlier Detection.

MACs Multi%2DAttribute Co%2Dclusters with High Correlation Information.

PUB A Class Description Technique Based on Partial Coverage of Subspace.


CP%2Dsummary a concise representation for browsing frequent itemsets.


Efficient Computation of Partial%2DSupport for Mining Interesting Itemsets.

Mining maximal quasi%2Dbicliques Novel algorithm and applications in the stock market and protein networks.

Distance Based Feature Selection for Clustering Microarray Data.

Classification in P2P Networks by Bagging Cascade RSVMs.
Abstract. Data mining tasks in P2P are bound by issues like scalability, peer dynamism, asynchronism, and data privacy preservation. These challenges pose difficulties for deploying conventional machine learning techniques in P2P networks, which may be hard to achieve classification accuracies comparable to regular centralized solutions. We recently investigated the classification problem in P2P networks and proposed a novel P2P classification approach by cascading Reduced Support Vector Machines (RSVM). Although promising results were obtained, the existing solution has some drawback of redundancy in both communication and computation. In this paper, we present a new approach to over the limitation of the previous approach. The new method can effectively reduce the redundancy and thus significantly improve the efficiency of communication and computation, meanwhile it still maintains good classification accuracies comparable to both the centralized solution and the previously proposed P2P solution. Experimental results demonstrate the feasibility and effectiveness of the new P2P classification solution. 1
Querying time%2Dseries streams.
In applications ranging from stock trading to space mission  operations, it is important to monitor the correlations among multiple  streaming time series efficiently in order to make timely decisions. The  challenge is that both the number of streaming time series and the number  of interested correlations can be large. The straightforward way of  performing the evaluation by computing the correlation value for each  relevant stream pair at each time position is not efficient enough in many situations. In
Rule Evolution Approach for Mining Multivariate Time Series Data.

Online Outlier Detection Based on Relative Neighbourhood Dissimilarity.

Two Way Focused Classification.

Estimating product lifecycle cost using a hybrid approach.

Mining Statistical Information of Frequent Fault%2DTolerant Patterns in Transactional Databases.

Intelligent E%2DLearning Systems %2D An Intelligent Approach to Flexible Learning Methodologies.

Mining Maximal Quasi%2DBicliques to Co%2DCluster Stocks and Financial Ratios for Value Investment.

Enhancing Edit Distance on Real Sequences Filters using Histogram Distance on Fixed Reference Ordering.

Efficient query processing with associated horizontal class partitioning in an object relational data warehousing environment.
In an Object Relational Data Warehousing  (ORDW) environment, the semantics of data and  queries can be explicitly captured, represented,  and utilized based on is-a and class composition  hierarchies, thereby resulting in more efficient  OLAP query processing. In this paper, we show  the efficacy in building semantic-rich hybrid  class partitions by incorporating the Associated  Horizontal Class Partitioning (AHCP) technique  on the ORDW schema. Given a set of queries,  we use primary and derived partitioning  algorithms to select (near) optimal AHCPs,  thereby embedding query semantics into the  partitioned framework. Finally, by a cost model,  we analyze the effectiveness of our approach visa  -vis the unpartitioned approach.  1 Introduction  Data warehouse (DW) equips users with more effective decision support tools by integrating enterprise-wide corporate data into a single repository from which business end-users can run reports and perform ad hoc data analysis [CD97]. As DWs con...


Star%2FSnow%2DFlake Schema Driven Object%2DRelational Data Warehouse %2D Design and Query Processing Strategies.
. The conventional star schema model of Data Warehouse (DW) has its limitations due to the nature of the relational data model. Firstly, this model cannot represent the semantics and operations of multi-dimensional data adequately. Due to the hidden semantics, it is difficult to efficiently address the problems of view design. Secondly, as we move up to higher levels of summary data (multiple complex aggregations), SQL queries do not portray the intuition needed to facilitate building and supporting efficient execution of complex queries on complex data. In light of these issues, we propose the ObjectRelational View (ORV) design for DWs. Using Object-Oriented (O-O) methodology, we can explicitly represent the semantics and reuse view (class) definitions based on the ISA hierarchy and the class composition hierarchies, thereby resulting in a more efficient view mechanism. Part of the design involves providing a translation mechanism from the star/snowflake schema to an O-O representatio...
